An Incompleteness Result for Deductive Synthesis of Logic Programs

نویسندگان

  • Kung-Kiu Lau
  • Mario Ornaghi
چکیده

We formalise the derivation of logic programs from their speciications by deductive synthesis, and introduce the notion of uniform equivalence between logical systems. This enables us to present an incompleteness result for deductive synthesis of logic programs from rst-order logic speciications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Halting Problem for Deductive Synthesis of Logic Programs

Deductive synthesis methods derive programs in an incremental manner, and therefore pose a halting problem { when can synthesis stop with a correct program? We give a characterisation of this problem and state a halting principle as a solution. Another characteristic of deductive synthesis is that it may derive several correct programs, giving rise to another question { which correct programs a...

متن کامل

Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs

Quality software must be reusable, extensible, and reliable. Object-oriented programming purports to achieve these attributes by the use of classes and inheritance (informally). In this paper, we show how our existing approach to deductive synthesis of logic programs can serve as the basis for an object-oriented methodology for formal program development that achieves reusability, extensibility...

متن کامل

Inconsistency and Incompleteness in Relational Databases and Logic Programs

The aim of this thesis is to study the role played by negation in databases and to develop data models that can handle inconsistent and incomplete information. We develop models that also allow incompleteness through disjunctive information under both the CWA and the OWA in relational databases. In the area of logic programming, extended logic programs allow explicit representation of negative ...

متن کامل

A Formal Framework for Synthesis and Verification of Logic Programs

In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information from constructive proofs. Here we will apply such a mechanism to give a proof-theoretic account of SLD-derivations. We show how proofs of suitable constructive systems can be used in the context of deductive synthesis o...

متن کامل

A Formal View of Speci cation , Deductive Synthesis

We view logic programs as ((rst-order) axiomatisations, and deductive synthesis and transformation as operations on mathematical systems composed of axioms and \logical" systems such as SLD and SLDNF. In this framework, we distinguish between speciication, deductive synthesis and transformation and discuss their interrelationships .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993